A Study on Secret Image Sharing

Information security becomes more and more important while the internet communication grows up. The secret image sharing technique, called (k, n) threshold scheme, is a useful method to protect our secret. This technique distributes a secret image to n shadow images preserved by n participants, respectively and we can only reveal the secret image by collecting at least k out of n shadow images. Fewer than k shadow images would not be sufficient to reveal the secret image. This paper discusses three commonly used secret sharing methods and provides our implementation results based on the Chinese Remainder Theorem. It takes fewer parameters than the other methods. Although we can only reveal the secret image with the average root mean square error less than 3, an additional image of the size being a quarter of that of the original one can ensure that the original image is completely recovered.